package algorithm.graph.adjacencylist;

import java.util.ArrayList;
import java.util.List;

public class Node {
    int index;
    int data;
    List<Edge> edgeList;

    public Node(int index) {
        this.index = index;
        this.edgeList = new ArrayList<>();
    }

    public int getIndex() {
        return index;
    }

    public void setIndex(int index) {
        this.index = index;
    }

    public int getData() {
        return data;
    }

    public void setData(int data) {
        this.data = data;
    }

    public List<Edge> getEdgeList() {
        return edgeList;
    }

    public void setEdgeList(List<Edge> edgeList) {
        this.edgeList = edgeList;
    }
}

